On Advances of Lattice-Based Cryptographic Schemes and Their Implementations

Lattice-based cryptography is centered around the hardness of problems on lattices. A lattice a grid points that stretches to infinity. With development quantum computers, existing cryptographic schemes are at risk because underlying mathematical can, in theory, be easily solved by computers. Since lattice-based hard even promising foundation for future schemes. In this paper, we focus public-key encryption This survey presents current status and discusses implementations. Our main learning with errors problem (LWE problem) its plain implementations variants special algebraic structures such as ring-based discussed. Additionally, describe class functions called trapdoors their applications.